Optimized Manufacturing Sequence for Hybrid Manufacturing

نویسندگان

  • David Homar
  • Slavko Dolinšek
  • Klas Boivie
چکیده

The aim of the paper is to present computer software which analyse a geometric design of product and determine which part of product will be done with CNC milling and which part will be done with additive technology. Subsequently it split the CAD model of product on two or more part and save part for CNC milling in format which is used for making CNC code and save part for additive manufacturing in STL format. This means that we developed algorithm for automatic determining the most suitable manufacturing sequences and technologies and also for converting this algorithm in computer software. Algorithm is implemented in Solid-Works CAD software by C# programing language.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Online Distribution and Load Balancing Optimization Using the Robin Hood and Johnson Hybrid Algorithm

Proper planning of assembly lines is one of the production managers’ concerns at the tactical level so that it would be possible to use the machine capacity, reduce operating costs and deliver customer orders on time. The lack of an efficient method in balancing assembly line can create threatening problems for manufacturing organizations. The use of assembly line balancing methods cannot balan...

متن کامل

A HYBRID GENETIC ALGORITHM FOR A BI-OBJECTIVE SCHEDULING PROBLEM IN A FLEXIBLE MANUFACTURING CELL

 This paper considers a bi-objective scheduling problem in a flexible manufacturing cell (FMC) which minimizes the maximum completion time (i.e., makespan) and maximum tardiness simultaneously. A new mathematical model is considered to reflect all aspect of the manufacturing cell. This type of scheduling problem is known to be NP-hard. To cope with the complexity of such a hard problem, a genet...

متن کامل

Meta heuristic for Minimizing Makespan in a Flow-line Manufacturing Cell with Sequence Dependent Family Setup Times

This paper presents a new mathematical model for the problem of scheduling part families and jobs within each part family in a flow line manufacturing cell where the setup times for each family are sequence dependent and it is desired to minimize the maximum completion time of the last job on the last machine (makespan) while processing parts (jobs) in each family together. Gaining an optimal s...

متن کامل

Optimization process planning using hybrid genetic algorithm and intelligent search for job shop machining

Optimization of process planning is considered as the key technology for computer-aided process planning which is a rather complex and difficult procedure. A good process plan of a part is built up based on two elements: (1) the optimized sequence of the operations of the part; and (2) the optimized selection of the machine, cutting tool and Tool Access Direction (TAD) for each operation. In th...

متن کامل

A novel mathematical model for a hybrid flow shop scheduling problem under buffer and resource limitations-A case study

Scheduling problems play a big role in manufacturing and planning the production for increasing the production efficiency and assigning the resources to operations. Furthermore, in many manufacturing systems there is a physical space between stages that called intermediate buffers. In this study, a model is proposed for minimizing the makespan of a hybrid flow shop scheduling problem with inter...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012